Circulant Graphs: Recognizing and Isomorphism Testing in Polynomial Time
نویسنده
چکیده
An algorithm is constructed for recognizing the circulant graphs and finding a canonical labeling for them in polynomial time. This algorithm also yields a cycle base of an arbitrary solvable permutation group. The consistency of the algorithm is based on a new result on the structure of Schur rings over a finite cyclic group. §
منابع مشابه
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time
We construct a polynomial-time algorithm that given a graph X with 4p vertices (p is prime), finds (if any) a Cayley representation of X over the group C2 × C2 × Cp. This result, together with the known similar result for circulant graphs, shows that recognising and testing isomorphism of Cayley graphs over an abelian group of order 4p can be done in polynomial time.
متن کاملRecognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
In this paper we present a time-polynomial recognition algorithm for certain classes of circulant graphs. Our approach uses coherent configurations and Schur rings generated by circulant graphs for elucidating their symmetry properties and eventually finding a cyclic automorphism.
متن کاملRecognizing Circulant Graphs of Prime Order in Polynomial Time Recognizing Circulant Graphs of Prime Order in Polynomial Time
1 Abstract In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant ii its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent connguration A and, in...
متن کاملIsomorphism testing for circulant graphs
In this paper we focus on connected directed/undirected circulant graphs Cn(a, b). We investigate some topological characteristics, and define a simple combinatorial model, which is new for the topic. Building on such a model, we derive a necessary and sufficient condition to test whether two circulant graphs Cn(a, b) and Cn(a , b) are isomorphic or not. The method is entirely elementary and co...
متن کاملThe Symmetric Circulant Traveling Salesman Problem
An n × n matrix D = d[i, j] is said to be circulant, if the entries d[i, j] verifying (j − i) = k mod n, for some k, have the same value (for a survey on circulant matrix properties, see Davis (1979)). A directed (respectively, undirected) graph is circulant, if its adjacency matrix is circulant (respectively, symmetric, and circulant). Similarly, a weighted graph is circulant, if its weighted ...
متن کامل